\section{Sense - Plan - Act}

	\subsection{Basic search algorithm}
	
		\begin{verbatim}
			GeneralSearch(initialState, goalState):
			queue = NodeList(Node(initialState))
			while len(queue) > 0 :
			    node = queue.pop();
			    if node is goal : return node
			    neighborNodes = node.expand()
			    for n in neighborNodes:
			        queue.append(n)
		\end{verbatim}
		
		\paragraph{Depth first\\}
		Queue is a stack (LIFO).
		Quickly finds one solution, but generally does not find the best solution very fast. Requires little memory.
		
		\paragraph{Breadth first\\}
		Queue is a NodeList (FIFO).
		Quickly finds one solution, but generally does not find the best solution very fast. Requires little memory.  